On the Translation of Procedures to Finite Machines Abstraction Allows a Clean Proof

ion Allows a Clean Proof Markus Müller-Olm and Andreas Wolf 2 ⋆ 1 Universität Dortmund, Fachbereich Informatik, LS V, 44221 Dortmund, Germany [email protected] 2 Christian-Albrechts-Universität, Institut für Informatik und Praktische Mathematik, Olshausenstraße 40, 24098 Kiel, Germany [email protected] Abstract. We prove the correctness of the translation of a prototypic While-language with nested, parameterless procedures to an abstract assembler language with finite stacks. A variant of the well-known wp and wlp predicate transformers, the weakest relative precondition transformer wrp, together with a symbolic approach for describing semantics of assembler code allows us to explore assembler programs in a manageable way and to ban finiteness from the scene early. We prove the correctness of the translation of a prototypic While-language with nested, parameterless procedures to an abstract assembler language with finite stacks. A variant of the well-known wp and wlp predicate transformers, the weakest relative precondition transformer wrp, together with a symbolic approach for describing semantics of assembler code allows us to explore assembler programs in a manageable way and to ban finiteness from the scene early.